Factoring Elementary p-Groups for p ≤ 7
نویسنده
چکیده
It is an open problem if an elementary p-group of rank k ≥ 3 does admit full-rank normalized factorization into two of its subsets such that one of the factors has p elements. The paper provides an answer in the p ≤ 7 special case.
منابع مشابه
Factoring elementary groups of prime cube order into subsets
Let p be a prime and let G be the 3-fold direct product of the cyclic group of order p. Rédei conjectured if G is the direct product of subsets A and B, each of which contains the identity element of G, then either A or B does not generate all of G. The paper verifies Rédei’s conjecture for p ≤ 11.
متن کاملA Simple Classification of Finite Groups of Order p2q2
Suppose G is a group of order p^2q^2 where p>q are prime numbers and suppose P and Q are Sylow p-subgroups and Sylow q-subgroups of G, respectively. In this paper, we show that up to isomorphism, there are four groups of order p^2q^2 when Q and P are cyclic, three groups when Q is a cyclic and P is an elementary ablian group, p^2+3p/2+7 groups when Q is an elementary ablian group an...
متن کاملPolynomial time factoring algorithm using Bayesian arithmetic
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion that P = NP. Now, we implement this concept in elementary arithmetic and especially in multiplication. This provides a polynomial time deterministic factoring a...
متن کاملConstruction of relative difference sets in p-groups
7 Davis, J.A., Construction of relative difference sets in p-groups, Discrete Mathematics 103 (1992) 7-15. Jungnickel (1982) and Elliot and Butson (1966) have shown that (pi+ , p, pi+•, pi) relative difference sets exist in the elementary abelian p-group case (p an odd prime) and many 2-groups for the case p = 2. This paper provides two new constructions of relative difference sets with these p...
متن کاملComputing in GF ( q ) By
This paper gives an elementary deterministic algorithm for completely factoring any polynomial over GF(q), q = p , criteria for the identification of three types of primitive polynomials, an exponential representation for GF(<j) which permits direct rational calculations in GF(q) as opposed to modular arithmetic over GF[p, xl, and a matrix representation for GF(p) which admits computer computat...
متن کامل